import _00GraphFuc as gf
import _00GraphTreeFuc as gt

#12.3.2二叉树的遍历
tree =['a',['b'],['c',['d',['f'],['g',['j'],['k']]],['e',['h'],['i']]]]
preorderlist = gt. preordertraversal(tree)
inorderlist = gt.inordertraversal(tree)
postorderlist =gt.postordertraversal(tree)
print("前序遍历",preorderlist)
print("中序遍历",inorderlist)
print("后序遍历",postorderlist)